Computation of the Folkman number Fe(3, 3; 5)
نویسندگان
چکیده
With the help of computer algorithms, we improve the lower bound on the edge Folkman number Fe(3, 3; 5) and vertex Folkman number Fv(3, 3; 4), and thus show that the exact values of these numbers are 15 and 14, respectively. We also present computer enumeration of all critical graphs.
منابع مشابه
Computation of the vertex Folkman numbers
In this note we show that the exact value of the vertex Folkman numbers F (2, 2, 2, 4; 6) and F (2, 3, 4; 6) is 14.
متن کاملMaster’s Thesis Proposal: Algorithms for Bounding Folkman Numbers
Introduction The study of Folkman numbers comes from the field of Ramsey theory. Ramsey theory is often phrased as the " party question: " What is the minimum number of people needed such that either r people all know each other or l people don't know each other? Clearly, such statements can be phrased as graph coloring problems: What is the smallest 2-colored complete graph such that for all c...
متن کاملApproximation of Points of the Convex Hull of a Sum of Sets by Points of the Sum: An Elementary Approach*
The Shapley-Folkman theorem and its corollaries [ 1, 2, 3, 4, 5, 6, 81 provide strong bounds on the distance between the sum of a family of nonconvex sets and the convex hull of the sum. Proofs of the theorem are nonconstructive, and require moderately advanced analysis. The proof developed below is based on elementary considerations. It provides an approximation sequentially with the successiv...
متن کاملElectromagnetic field analysis of novel low cogging force, linear switched reluctance motor, based on 2-D finite element method
This paper deals with electromagnetic design and 2-D (two-dimensional) magnetic field analysis of novel low force ripple linear switched reluctance (LSR) motor. The configuration that has been presented here has a higher number of rotor poles than stator poles, and the purpose of this configuration is to improve the force ripple, which is the weak point of LSRMs. In order to illustrate the ...
متن کاملAn Example of a 16-vertex Folkman Edge (3,4)-graph without 8-cliques
In [6] we computed the edge Folkman number F (3, 4; 8) = 16. There we used and announced without proof that in any blue-red coloring of the edges of the graph K1 +C5 +C5 + C5 there is either a blue 3-clique or red 4-clique. In this paper we give a detailed proof of this fact.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of Graph Theory
دوره 32 شماره
صفحات -
تاریخ انتشار 1999